0.03/0.12	% Problem    : SLH136^1 : TPTP v7.5.0. Released v7.5.0.
0.03/0.13	% Command    : run_E %s %d THM
0.14/0.34	% Computer : n025.cluster.edu
0.14/0.34	% Model    : x86_64 x86_64
0.14/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.14/0.34	% Memory   : 8042.1875MB
0.14/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.14/0.34	% CPULimit   : 30
0.14/0.34	% WCLimit    : 30
0.14/0.34	% DateTime   : Tue Aug  9 02:37:41 EDT 2022
0.14/0.34	% CPUTime    : 
0.20/0.47	The problem SPC is TH0_THM_EQU_NAR
0.20/0.47	Running higher-order on 1 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox2/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=1 --cpu-limit=30 /export/starexec/sandbox2/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.50/0.72	# Preprocessing class: HSLSSMSSSSSNSFA.
0.50/0.72	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.50/0.72	# Starting new_ho_11 with 30s (1) cores
0.50/0.72	# new_ho_11 with pid 5778 completed with status 0
0.50/0.72	# Result found by new_ho_11
0.50/0.72	# Preprocessing class: HSLSSMSSSSSNSFA.
0.50/0.72	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.50/0.72	# Starting new_ho_11 with 30s (1) cores
0.50/0.72	# No SInE strategy applied
0.50/0.72	# Search class: HGHSM-FSLF21-MSFFFFBN
0.50/0.72	# partial match(1): HGHSM-FSLM21-MSFFFFBN
0.50/0.72	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.50/0.72	# Starting new_ho_10 with 17s (1) cores
0.50/0.72	# new_ho_10 with pid 5779 completed with status 0
0.50/0.72	# Result found by new_ho_10
0.50/0.72	# Preprocessing class: HSLSSMSSSSSNSFA.
0.50/0.72	# Scheduled 1 strats onto 1 cores with 30 seconds (30 total)
0.50/0.72	# Starting new_ho_11 with 30s (1) cores
0.50/0.72	# No SInE strategy applied
0.50/0.72	# Search class: HGHSM-FSLF21-MSFFFFBN
0.50/0.72	# partial match(1): HGHSM-FSLM21-MSFFFFBN
0.50/0.72	# Scheduled 5 strats onto 1 cores with 30 seconds (30 total)
0.50/0.72	# Starting new_ho_10 with 17s (1) cores
0.50/0.72	# Preprocessing time       : 0.004 s
0.50/0.72	# Presaturation interreduction done
0.50/0.72	
0.50/0.72	# Proof found!
0.50/0.72	# SZS status Theorem
0.50/0.72	# SZS output start CNFRefutation
0.50/0.72	thf(decl_22, type, minus_minus_nat: nat > nat > nat).
0.50/0.72	thf(decl_23, type, plus_plus_nat: nat > nat > nat).
0.50/0.72	thf(decl_24, type, zero_zero_nat: nat).
0.50/0.72	thf(decl_25, type, nth_a: list_a > nat > a).
0.50/0.72	thf(decl_26, type, size_size_list_a: list_a > nat).
0.50/0.72	thf(decl_27, type, ord_less_nat: nat > nat > $o).
0.50/0.72	thf(decl_28, type, ord_less_eq_nat: nat > nat > $o).
0.50/0.72	thf(decl_29, type, f: nat > a).
0.50/0.72	thf(decl_30, type, g: nat > a).
0.50/0.72	thf(decl_31, type, i: nat).
0.50/0.72	thf(decl_32, type, xs: list_a).
0.50/0.72	thf(decl_33, type, ys: list_a).
0.50/0.72	thf(decl_34, type, esk1_1: (nat > $o) > nat).
0.50/0.72	thf(decl_35, type, esk2_1: (nat > $o) > nat).
0.50/0.72	thf(decl_36, type, esk3_2: (nat > $o) > nat > nat).
0.50/0.72	thf(decl_37, type, esk4_1: (nat > $o) > nat).
0.50/0.72	thf(decl_38, type, esk5_2: nat > nat > nat).
0.50/0.72	thf(decl_39, type, esk6_2: nat > nat > nat).
0.50/0.72	thf(decl_40, type, esk7_2: nat > nat > nat).
0.50/0.72	thf(decl_41, type, esk8_2: nat > nat > nat).
0.50/0.72	thf(decl_42, type, esk9_2: nat > nat > nat).
0.50/0.72	thf(decl_43, type, esk10_2: nat > nat > nat).
0.50/0.72	thf(decl_44, type, esk11_1: (nat > $o) > nat).
0.50/0.72	thf(decl_45, type, esk12_1: (nat > nat) > nat).
0.50/0.72	thf(decl_46, type, esk13_1: (nat > nat) > nat).
0.50/0.72	thf(decl_47, type, esk14_2: nat > nat > nat).
0.50/0.72	thf(decl_48, type, esk15_2: nat > nat > nat).
0.50/0.72	thf(decl_49, type, esk16_2: nat > nat > nat).
0.50/0.72	thf(fact_58_add_Ocommute, axiom, ((plus_plus_nat)=(^[X11:nat, X12:nat]:(plus_plus_nat @ X12 @ X11))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_58_add_Ocommute)).
0.50/0.72	thf(conj_2, conjecture, ((~((ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))=(g @ zero_zero_nat)))&((ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|((~((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))|((g @ zero_zero_nat)=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))))&((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys)))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_2)).
0.50/0.72	thf(fact_59_add_Oassoc, axiom, ![X6:nat, X7:nat, X8:nat]:(((plus_plus_nat @ (plus_plus_nat @ X6 @ X7) @ X8)=(plus_plus_nat @ X6 @ (plus_plus_nat @ X7 @ X8)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_59_add_Oassoc)).
0.50/0.72	thf(fact_145_nat__diff__right__cancel__less, axiom, ![X5:nat, X1:nat, X4:nat]:(((ord_less_nat @ (minus_minus_nat @ X5 @ X1) @ (minus_minus_nat @ X4 @ X1))=>(ord_less_nat @ X5 @ X4))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_145_nat__diff__right__cancel__less)).
0.50/0.72	thf(fact_29_add__diff__cancel__right_H, axiom, ![X6:nat, X7:nat]:(((minus_minus_nat @ (plus_plus_nat @ X6 @ X7) @ X7)=(X6))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_29_add__diff__cancel__right_H)).
0.50/0.72	thf(fact_127_less__or__eq__imp__le, axiom, ![X4:nat, X5:nat]:((((ord_less_nat @ X4 @ X5)|((X4)=(X5)))=>(ord_less_eq_nat @ X4 @ X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_127_less__or__eq__imp__le)).
0.50/0.72	thf(fact_85_less__ge__neq__conv, axiom, ((ord_less_nat)=(^[X26:nat, X11:nat]:(![X27:nat]:(((ord_less_eq_nat @ X11 @ X27)=>((X26)!=(X27))))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_85_less__ge__neq__conv)).
0.50/0.72	thf(fact_211_add__le__imp__le__diff, axiom, ![X3:nat, X1:nat, X5:nat]:(((ord_less_eq_nat @ (plus_plus_nat @ X3 @ X1) @ X5)=>(ord_less_eq_nat @ X3 @ (minus_minus_nat @ X5 @ X1)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_211_add__le__imp__le__diff)).
0.50/0.72	thf(fact_75_le__antisym, axiom, ![X4:nat, X5:nat]:(((ord_less_eq_nat @ X4 @ X5)=>((ord_less_eq_nat @ X5 @ X4)=>((X4)=(X5))))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_75_le__antisym)).
0.50/0.72	thf(fact_8_le__add__diff__inverse, axiom, ![X7:nat, X6:nat]:(((ord_less_eq_nat @ X7 @ X6)=>((plus_plus_nat @ X7 @ (minus_minus_nat @ X6 @ X7))=(X6)))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_8_le__add__diff__inverse)).
0.50/0.72	thf(fact_68_less__irrefl__nat, axiom, ![X5:nat]:(~((ord_less_nat @ X5 @ X5))), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', fact_68_less__irrefl__nat)).
0.50/0.72	thf(conj_0, hypothesis, (ord_less_eq_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys)), file('/export/starexec/sandbox2/benchmark/theBenchmark.p', conj_0)).
0.50/0.72	thf(c_0_12, plain, ![X545:nat, X546:nat]:(((plus_plus_nat @ X545 @ X546)=(plus_plus_nat @ X546 @ X545))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_58_add_Ocommute])])).
0.50/0.72	thf(c_0_13, negated_conjecture, ~(((~(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))=(g @ zero_zero_nat)))&((ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((g @ zero_zero_nat)=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))))&((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))))))), inference(fof_simplification,[status(thm)],[inference(assume_negation,[status(cth)],[conj_2])])).
0.50/0.72	thf(c_0_14, plain, ![X680:nat, X681:nat]:(((plus_plus_nat @ X680 @ X681)=(plus_plus_nat @ X681 @ X680))), inference(variable_rename,[status(thm)],[c_0_12])).
0.50/0.72	thf(c_0_15, plain, ![X682:nat, X683:nat, X684:nat]:(((plus_plus_nat @ (plus_plus_nat @ X682 @ X683) @ X684)=(plus_plus_nat @ X682 @ (plus_plus_nat @ X683 @ X684)))), inference(variable_rename,[status(thm)],[fact_59_add_Oassoc])).
0.50/0.72	thf(c_0_16, negated_conjecture, ((((~(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))&(((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))&(((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))))&((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((g @ zero_zero_nat)!=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i)))|(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))&(((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))|((g @ zero_zero_nat)!=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i)))|(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))))))&((~(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))&(((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))&(((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))))&((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((g @ zero_zero_nat)!=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i)))|~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))&(((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))|((g @ zero_zero_nat)!=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i)))|~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))))))&((~(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))!=(g @ zero_zero_nat)))&(((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))!=(g @ zero_zero_nat)))&(((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))!=(g @ zero_zero_nat))))&((~(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|((g @ zero_zero_nat)!=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i)))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))!=(g @ zero_zero_nat)))&(((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))|((g @ zero_zero_nat)!=(nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i)))|((nth_a @ ys @ (plus_plus_nat @ (size_size_list_a @ xs) @ i))!=(g @ zero_zero_nat))))))), inference(distribute,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_13])])).
0.50/0.72	thf(c_0_17, plain, ![X2:nat, X1:nat]:(((plus_plus_nat @ X1 @ X2)=(plus_plus_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_14])).
0.50/0.72	thf(c_0_18, plain, ![X1:nat, X2:nat, X3:nat]:(((plus_plus_nat @ (plus_plus_nat @ X1 @ X2) @ X3)=(plus_plus_nat @ X1 @ (plus_plus_nat @ X2 @ X3)))), inference(split_conjunct,[status(thm)],[c_0_15])).
0.50/0.72	thf(c_0_19, negated_conjecture, ((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|((g @ (minus_minus_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))!=(g @ (minus_minus_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.50/0.72	thf(c_0_20, plain, ![X2:nat, X1:nat]:(((plus_plus_nat @ X1 @ X2)=(plus_plus_nat @ X2 @ X1))), c_0_17).
0.50/0.72	thf(c_0_21, plain, ![X1:nat, X2:nat, X3:nat]:(((plus_plus_nat @ (plus_plus_nat @ X1 @ X2) @ X3)=(plus_plus_nat @ X1 @ (plus_plus_nat @ X2 @ X3)))), c_0_18).
0.50/0.72	thf(c_0_22, plain, ![X916:nat, X917:nat, X918:nat]:((~(ord_less_nat @ (minus_minus_nat @ X916 @ X917) @ (minus_minus_nat @ X918 @ X917))|(ord_less_nat @ X916 @ X918))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_145_nat__diff__right__cancel__less])])).
0.50/0.72	thf(c_0_23, plain, ![X623:nat, X624:nat]:(((minus_minus_nat @ (plus_plus_nat @ X623 @ X624) @ X624)=(X623))), inference(variable_rename,[status(thm)],[fact_29_add__diff__cancel__right_H])).
0.50/0.72	thf(c_0_24, plain, ![X872:nat, X873:nat]:(((~(ord_less_nat @ X872 @ X873)|(ord_less_eq_nat @ X872 @ X873))&(((X872)!=(X873))|(ord_less_eq_nat @ X872 @ X873)))), inference(distribute,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_127_less__or__eq__imp__le])])])).
0.50/0.72	thf(c_0_25, negated_conjecture, ((ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys))|(ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))), inference(ar,[status(thm)],[c_0_19, c_0_20, c_0_21])).
0.50/0.72	thf(c_0_26, negated_conjecture, (~((ord_less_nat @ (plus_plus_nat @ (size_size_list_a @ xs) @ i) @ (size_size_list_a @ ys)))|~((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))), inference(split_conjunct,[status(thm)],[c_0_16])).
0.50/0.72	thf(c_0_27, plain, ![X1:nat, X3:nat, X2:nat]:(((ord_less_nat @ X1 @ X3)|~((ord_less_nat @ (minus_minus_nat @ X1 @ X2) @ (minus_minus_nat @ X3 @ X2))))), inference(split_conjunct,[status(thm)],[c_0_22])).
0.50/0.72	thf(c_0_28, plain, ![X2:nat, X1:nat]:(((minus_minus_nat @ (plus_plus_nat @ X1 @ X2) @ X2)=(X1))), inference(split_conjunct,[status(thm)],[c_0_23])).
0.50/0.72	thf(c_0_29, plain, ![X551:nat, X552:nat]:(((ord_less_nat @ X551 @ X552)<=>![X27:nat]:(((ord_less_eq_nat @ X552 @ X27)=>((X551)!=(X27)))))), inference(fof_simplification,[status(thm)],[inference(fof_simplification,[status(thm)],[fact_85_less__ge__neq__conv])])).
0.50/0.72	thf(c_0_30, plain, ![X1:nat, X2:nat]:(((ord_less_eq_nat @ X1 @ X2)|~((ord_less_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_24])).
0.50/0.72	thf(c_0_31, negated_conjecture, ((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))), inference(rw,[status(thm)],[c_0_25, c_0_17])).
0.50/0.72	thf(c_0_32, negated_conjecture, (~((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))))|~((ord_less_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys)))), inference(rw,[status(thm)],[c_0_26, c_0_17])).
0.50/0.72	thf(c_0_33, plain, ![X1:nat, X3:nat, X2:nat]:(((ord_less_nat @ (plus_plus_nat @ X1 @ X2) @ X3)|~((ord_less_nat @ X1 @ (minus_minus_nat @ X3 @ X2))))), inference(spm,[status(thm)],[c_0_27, c_0_28])).
0.50/0.72	thf(c_0_34, plain, ![X758:nat, X759:nat, X760:nat, X761:nat, X762:nat]:(((~(ord_less_nat @ X758 @ X759)|(~(ord_less_eq_nat @ X759 @ X760)|((X758)!=(X760))))&(((ord_less_eq_nat @ X762 @ (esk7_2 @ X761 @ X762))|(ord_less_nat @ X761 @ X762))&(((X761)=(esk7_2 @ X761 @ X762))|(ord_less_nat @ X761 @ X762))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_29])])])])])])).
0.50/0.72	thf(c_0_35, plain, ![X1111:nat, X1112:nat, X1113:nat]:((~(ord_less_eq_nat @ (plus_plus_nat @ X1111 @ X1112) @ X1113)|(ord_less_eq_nat @ X1111 @ (minus_minus_nat @ X1113 @ X1112)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_211_add__le__imp__le__diff])])).
0.50/0.72	thf(c_0_36, negated_conjecture, ((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))|(ord_less_eq_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys))), inference(spm,[status(thm)],[c_0_30, c_0_31])).
0.50/0.72	thf(c_0_37, negated_conjecture, ~((ord_less_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)))), inference(spm,[status(thm)],[c_0_32, c_0_33])).
0.50/0.72	thf(c_0_38, plain, ![X2:nat, X1:nat]:(((ord_less_eq_nat @ X1 @ (esk7_2 @ X2 @ X1))|(ord_less_nat @ X2 @ X1))), inference(split_conjunct,[status(thm)],[c_0_34])).
0.50/0.72	thf(c_0_39, plain, ![X1:nat, X2:nat]:((((X1)=(esk7_2 @ X1 @ X2))|(ord_less_nat @ X1 @ X2))), inference(split_conjunct,[status(thm)],[c_0_34])).
0.50/0.72	thf(c_0_40, plain, ![X729:nat, X730:nat]:((~(ord_less_eq_nat @ X729 @ X730)|(~(ord_less_eq_nat @ X730 @ X729)|((X729)=(X730))))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_75_le__antisym])])).
0.50/0.72	thf(c_0_41, plain, ![X1:nat, X2:nat, X3:nat]:(((ord_less_eq_nat @ X1 @ (minus_minus_nat @ X3 @ X2))|~((ord_less_eq_nat @ (plus_plus_nat @ X1 @ X2) @ X3)))), inference(split_conjunct,[status(thm)],[c_0_35])).
0.50/0.72	thf(c_0_42, negated_conjecture, (ord_less_eq_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys)), inference(sr,[status(thm)],[c_0_36, c_0_37])).
0.50/0.72	thf(c_0_43, plain, ![X2:nat, X1:nat]:(((ord_less_nat @ X1 @ X2)|(ord_less_eq_nat @ X2 @ X1))), inference(spm,[status(thm)],[c_0_38, c_0_39])).
0.50/0.72	thf(c_0_44, plain, ![X582:nat, X583:nat]:((~(ord_less_eq_nat @ X582 @ X583)|((plus_plus_nat @ X582 @ (minus_minus_nat @ X583 @ X582))=(X583)))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[fact_8_le__add__diff__inverse])])).
0.50/0.72	thf(c_0_45, plain, ![X2:nat, X1:nat]:((((X1)=(X2))|~((ord_less_eq_nat @ X1 @ X2))|~((ord_less_eq_nat @ X2 @ X1)))), inference(split_conjunct,[status(thm)],[c_0_40])).
0.50/0.72	thf(c_0_46, negated_conjecture, (ord_less_eq_nat @ i @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))), inference(spm,[status(thm)],[c_0_41, c_0_42])).
0.50/0.72	thf(c_0_47, negated_conjecture, (ord_less_eq_nat @ (minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs)) @ i), inference(spm,[status(thm)],[c_0_37, c_0_43])).
0.50/0.72	thf(c_0_48, plain, ![X5:nat]:(~(ord_less_nat @ X5 @ X5)), inference(fof_simplification,[status(thm)],[fact_68_less__irrefl__nat])).
0.50/0.72	thf(c_0_49, plain, ![X1:nat, X2:nat]:((((plus_plus_nat @ X1 @ (minus_minus_nat @ X2 @ X1))=(X2))|~((ord_less_eq_nat @ X1 @ X2)))), inference(split_conjunct,[status(thm)],[c_0_44])).
0.50/0.72	thf(c_0_50, negated_conjecture, ((minus_minus_nat @ (size_size_list_a @ ys) @ (size_size_list_a @ xs))=(i)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_45, c_0_46]), c_0_47])])).
0.50/0.72	thf(c_0_51, hypothesis, (ord_less_eq_nat @ (size_size_list_a @ xs) @ (size_size_list_a @ ys)), inference(split_conjunct,[status(thm)],[conj_0])).
0.50/0.72	thf(c_0_52, plain, ![X713:nat]:(~(ord_less_nat @ X713 @ X713)), inference(variable_rename,[status(thm)],[c_0_48])).
0.50/0.72	thf(c_0_53, negated_conjecture, (ord_less_nat @ (plus_plus_nat @ i @ (size_size_list_a @ xs)) @ (size_size_list_a @ ys)), inference(sr,[status(thm)],[c_0_31, c_0_37])).
0.50/0.72	thf(c_0_54, negated_conjecture, ((plus_plus_nat @ i @ (size_size_list_a @ xs))=(size_size_list_a @ ys)), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_49, c_0_50]), c_0_17]), c_0_51])])).
0.50/0.72	thf(c_0_55, plain, ![X1:nat]:(~((ord_less_nat @ X1 @ X1))), inference(split_conjunct,[status(thm)],[c_0_52])).
0.50/0.72	thf(c_0_56, negated_conjecture, ($false), inference(sr,[status(thm)],[inference(rw,[status(thm)],[c_0_53, c_0_54]), c_0_55]), ['proof']).
0.50/0.72	# SZS output end CNFRefutation
0.50/0.72	# Parsed axioms                        : 230
0.50/0.72	# Removed by relevancy pruning/SinE    : 0
0.50/0.72	# Initial clauses                      : 322
0.50/0.72	# Removed in clause preprocessing      : 29
0.50/0.72	# Initial clauses in saturation        : 293
0.50/0.72	# Processed clauses                    : 1570
0.50/0.72	# ...of these trivial                  : 41
0.50/0.72	# ...subsumed                          : 871
0.50/0.72	# ...remaining for further processing  : 658
0.50/0.72	# Other redundant clauses eliminated   : 469
0.50/0.72	# Clauses deleted for lack of memory   : 0
0.50/0.72	# Backward-subsumed                    : 41
0.50/0.72	# Backward-rewritten                   : 46
0.50/0.72	# Generated clauses                    : 16535
0.50/0.72	# ...of the previous two non-redundant : 14319
0.50/0.72	# ...aggressively subsumed             : 0
0.50/0.72	# Contextual simplify-reflections      : 13
0.50/0.72	# Paramodulations                      : 16049
0.50/0.72	# Factorizations                       : 8
0.50/0.72	# NegExts                              : 0
0.50/0.72	# Equation resolutions                 : 477
0.50/0.72	# Propositional unsat checks           : 0
0.50/0.72	#    Propositional check models        : 0
0.50/0.72	#    Propositional check unsatisfiable : 0
0.50/0.72	#    Propositional clauses             : 0
0.50/0.72	#    Propositional clauses after purity: 0
0.50/0.72	#    Propositional unsat core size     : 0
0.50/0.72	#    Propositional preprocessing time  : 0.000
0.50/0.72	#    Propositional encoding time       : 0.000
0.50/0.72	#    Propositional solver time         : 0.000
0.50/0.72	#    Success case prop preproc time    : 0.000
0.50/0.72	#    Success case prop encoding time   : 0.000
0.50/0.72	#    Success case prop solver time     : 0.000
0.50/0.72	# Current number of processed clauses  : 391
0.50/0.72	#    Positive orientable unit clauses  : 54
0.50/0.72	#    Positive unorientable unit clauses: 3
0.50/0.72	#    Negative unit clauses             : 18
0.50/0.72	#    Non-unit-clauses                  : 316
0.50/0.72	# Current number of unprocessed clauses: 13069
0.50/0.72	# ...number of literals in the above   : 35665
0.50/0.72	# Current number of archived formulas  : 0
0.50/0.72	# Current number of archived clauses   : 226
0.50/0.72	# Clause-clause subsumption calls (NU) : 19141
0.50/0.72	# Rec. Clause-clause subsumption calls : 17534
0.50/0.72	# Non-unit clause-clause subsumptions  : 477
0.50/0.72	# Unit Clause-clause subsumption calls : 1408
0.50/0.72	# Rewrite failures with RHS unbound    : 0
0.50/0.72	# BW rewrite match attempts            : 122
0.50/0.72	# BW rewrite match successes           : 75
0.50/0.72	# Condensation attempts                : 1570
0.50/0.72	# Condensation successes               : 11
0.50/0.72	# Termbank termtop insertions          : 163352
0.50/0.72	
0.50/0.72	# -------------------------------------------------
0.50/0.72	# User time                : 0.226 s
0.50/0.72	# System time              : 0.011 s
0.50/0.72	# Total time               : 0.237 s
0.50/0.72	# Maximum resident set size: 3072 pages
0.50/0.72	
0.50/0.72	# -------------------------------------------------
0.50/0.72	# User time                : 0.233 s
0.50/0.72	# System time              : 0.012 s
0.50/0.72	# Total time               : 0.245 s
0.50/0.72	# Maximum resident set size: 1872 pages
0.50/0.72	EOF